Gradual parametricity, revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parametricity as Isomorphism

We investigatea simple form of parametricity, based on adding \abstract" copies of pre-existing types. Connections are made with the Reynolds-Ma theory of parametricity by logical relations, with the theory of parametricity via dinaturality, and with the categorical notion of equivalence.

متن کامل

Subtyping and Parametricity

In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic supports the formal definition and use of relational parametricity. We give two models for it, and compare it with other formal systems for the same language. In particular, we examine the “Penn interpretation” of subtyping a...

متن کامل

Strachey Parametricity and Game Semantics

We propose and analyse in this paper a criterion for Strachey parametricity, which is satisfied in particular by system F with its usual equality rules. The criterion is based on a simple restriction of the dinaturality diagram. Game semantics is used as an illustration of this criterion, providing both a parametric model and a non-parametric one. But it is also as a tool to explain how the cri...

متن کامل

Parametricity in an Impredicative Sort

Reynold’s abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions (CIC), the underlying formal language of Coq, in which parametricity relations’ codomain is the impredicative sort of propositions. To proceed, we need to refin...

متن کامل

Relational Parametricity for Higher Kinds

Reynolds’ notion of relational parametricity has been extremely influential and well studied for polymorphic programming languages and type theories based on System F. The extension of relational parametricity to higher kinded polymorphism, which allows quantification over type operators as well as types, has not received as much attention. We present a model of relational parametricity for Sys...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on Programming Languages

سال: 2019

ISSN: 2475-1421

DOI: 10.1145/3290330